Genetic Algorithms Based Solution To Maximum Clique Problem
نویسندگان
چکیده
Maximum Clique Problem (MCP) is an NP Complete problem which finds its application in diverse fields. The work suggests the solution of above problem with the help of Genetic Algorithms (GAs). The work also takes into consideration, the various attempts that have been made to solve this problem and other such problems. The intend is to develop a generic methodology to solve all NP Complete problems via GAs thus exploring their ability to find out the optimal solution from amongst huge set of solutions. The work has been implemented and analyzed with satisfactory results. KeywordsMax Clique; NP Complete; Genetic Algorithm; Heuristic Search
منابع مشابه
A Maximum Edge-weight Clique Finding Algorithmic Approach for Solving Protein Side-chain Positioning Problem
We have developed a novel approach to solve the protein side-chain packing problem using the notion of a maximum edge-weight clique. Our approach is based on efficient reduction of protein side-chain packing problem to a graph and then solving the reduced graph to find the maximum clique. Since our approach is based on deterministic algorithms in contrast to the various existing algorithms base...
متن کاملComplexity Analysis of Clique Problem
MAXIMUM CLIQUE PROBLEM the most relevant problem in Graph theory, known for years still do not have its polynomial time solution. Many algorithms have been proposed, still the problem lie the same i.e. to find the Clique in the polynomial time. The Clique problem is to figure out the sub graph with the maximum cardinality. Maximum clique in a random graph is NP-Hard problem, actuated by many pr...
متن کاملModified Approach for Solving Maximum Clique Problem
1.1 Maximum Clique Problem Assume that the finite undirected simple graph is given, where V is the set of nodes, E is the set of edges. The arbitrary full graph is called a clique. The clique, which does not contain other cliques, is called a maximal Clique. The largest maximal clique is called a maximum clique. To extract all maximal cliques from the graph G. Many algorithms have...
متن کاملAn Ant System Algorithm for Maximum Clique
This paper presents a hybrid algorithm for solving the maximum clique problem. The algorithm is a blend of agent-based and local optimization techniques. Unlike typical Ant Colony Optimization (ACO) algorithms, agents in this algorithm are denied global knowledge. This restriction facilitates the expansion of this solution into a distributed algorithm capable of running across a network. Experi...
متن کاملAn Improved Chaotic Maximum Neural Network for Maximum Clique Problem
We propose an improved chaotic maximum neural network to solve maximum clique problem. Through analyzing the character of maximum neural network with an added vertex in maximum clique problem, we find that the quality and size of clique solution can be modified by tuning a parameter about vertex weight. Based on the analysis, a random nonlinear self-feedback and flexible annealing strategy are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012